How to Construct a Power Knowledge Graph with Dispatching Data?
نویسندگان
چکیده
منابع مشابه
A Greedy Algorithm to Construct L1 Graph with Ranked Dictionary
L1 graph is an effective way to represent data samples in many graph-oriented machine learning applications. Its original construction algorithm is nonparametric, and the graphs it generates may have high sparsity. Meanwhile, the construction algorithm also requires many iterative convex optimization calculations and is very time-consuming. Such characteristics would severely limit the applicat...
متن کاملOperating Analysis and Data Mining System for Power Grid Dispatching
The dispatching center of power-grid companies is also the data center of the power grid where gathers great amount of operating information. The valuable information contained in these data means a lot for power grid operating management, but at present there is no special method for the management of operating data resource. This paper introduces the operating analysis and data mining system ...
متن کاملHow to Construct a Mobile Botnet?
Botnets are one of the most serious security threats to the Internet and the personal computer (PC) world, but they have not yet caused major outbreaks in the mobile world. Nevertheless, attacks on mobile networks and devices have recently grown in number and sophistication. With the arrival of smartphones such as the iPhone and Android-based phones, there has been a drastic increase in downloa...
متن کاملHow to Construct a GRB Engine?
Our understanding of Gamma-Ray Bursts (GRBs) was revolutionized during the last ten years. According to the generally accepted Fireball model (see e.g. [1, 2]) the gamma-rays and their subsequent multiwavelength afterglow are produced when an ultra-relativistic flow is slowed down. All current observations, from prompt emission to late afterglow, from γ-rays via X-ray optical and IR to radio, a...
متن کاملHow to Construct Tetris Configurations
In this paper we show that every (reasonable) TETRIS configuration can be constructed from an initially empty game board using a suitable sequence of pieces. On game boards of even width a simple parity condition has to be fulfilled. The paper provides an explicit construction. This problem is connected to the NP-completeness of certain TETRIS related decision problems. INTRODUCTION It has rece...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 2020
ISSN: 1058-9244,1875-919X
DOI: 10.1155/2020/8842463